Kesten–McKay law for the Markoff surface mod p
نویسندگان
چکیده
For each prime p, we study the eigenvalues of a 3-regular graph on roughly p 2 vertices constructed from Markoff surface. We show they asymptotically follow Kesten–McKay law, which also describes random regular graph. The proof is based method moments and takes advantage natural group action
منابع مشابه
Lower Bounds for (MOD p - MOD m) Circuits
Modular gates are known to be immune for the random restriction techniques of Ajtai Ajt83], Furst, Saxe, Sipser FSS84], Yao Yao85] and H astad H as86]. We demonstrate here a random clustering technique which overcomes this diiculty and is capable to prove generalizations of several known modular circuit lower bounds of Barrington, Straubing, Th erien BST90], Krause and Pudll ak KP94], and other...
متن کاملA Degree-Decreasing Lemma for (MOD q - MOD p) Circuits
Consider a (MODq;MODp) circuit, where the inputs of the bottom MODp gates are degree-d polynomials with integer coefficients of the input variables (p, q are different primes). Using our main tool — the Degree Decreasing Lemma — we show that this circuit can be converted to a (MODq;MODp) circuit with linear polynomials on the input-level with the price of increasing the size of the circuit. Thi...
متن کاملRANK p − 1 MOD - p H - SPACES
Different constructions by Cooke, Harper and Zabrodsky and by Cohen and Neisendorfer produce torsion free finite p-local H-spaces of rank l < p−1. The first construction goes through when l = p− 1 and we show the second does as well. However, the space produced need not be an H-space. We give a criterion for when an H-space is obtained. In the special case of rank 2 mod-3 H-spaces, we also give...
متن کاملInterpolation of Markoff Transformations on the Fricke Surface
By the Fricke surfaces, we mean the space defined by the equation p2 + q2 + r2 − pqr− k = 0 in the space R(p, q, r). When k = 0, it is naturally isomorphic to the moduli of once-punctured tori. It was Markoff who found the transformations, called Markoff transformations, acting on the Fricke surface. The transformation is typically given by (p, q, r) → (r, q, rq − p) acting on R3 that keeps the...
متن کاملA New Algorithm for Inversion mod p
A new algorithm for computing x = a−1 (mod pk) is introduced. It is based on the exact solution of linear equations using p-adic expansions. It starts with the initial value c = a−1 (mod p) and iteratively computes the digits of the inverse x = a−1 (mod pk) in base p. The mod 2 version of the algorithm is significantly more efficient than the existing algorithms for small values of k. We also d...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annales Henri Lebesgue
سال: 2021
ISSN: ['2644-9463']
DOI: https://doi.org/10.5802/ahl.71